Palindromic Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
نویسندگان
چکیده
Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue problems are considered. These structures generalize the concepts of symplectic and Hamiltonian matrices to matrix polynomials. We discuss several applications where these matrix polynomials arise, and show how linearizations can be derived that reflect the structure of all these structured matrix polynomials and therefore preserve symmetries in the spectrum.
منابع مشابه
Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
Many applications give rise to nonlinear eigenvalue problems with an underlying structured matrix polynomial. In this paper several useful classes of structured polynomial (e.g., palindromic, even, odd) are identified and the relationships between them explored. A special class of linearizations that reflect the structure of these polynomials, and therefore preserve symmetries in their spectra,...
متن کاملPalindromic companion forms for matrix polynomials of odd degree
The standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynomial P (λ) into a matrix pencil that preserves its spectral information– a process known as linearization. When P (λ) is palindromic, the eigenvalues, elementary divisors, and minimal indices of P (λ) have certain symmetries that can be lost when using the classical first and second Frobenius comp...
متن کاملPerturbation of Palindromic Eigenvalue Problems
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic P (λ) ≡ λA1 + λA0 + A1, with A0, A1 ∈ Cn×n and A0 = A0. The perturbation of palindromic eigenvalues and eigenvectors, in terms of general matrix polynomials, palindromic linearizations, (semi-Schur) anti-triangular canonical forms, differentiation and Sun’s implicit function approach, are discussed.
متن کاملPalindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...
متن کاملPalindromic Linearizations of a Matrix Polynomial of Odd Degree Obtained from Fiedler Pencils with Repetition
Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...
متن کامل